منابع مشابه
Concretization, Explanation, and Mechanisms
Traditional accounts of explanation fail to illuminate the explanatory relevance of “models that are descriptively false” in the sense that the regularities they entail fail to obtain. In this paper, I propose an account of explanation, which I call ‘explanation by concretization’, that serves to explicate the explanatory relevance of such models. Starting from a highly abstract and idealized m...
متن کاملPolymorphic typed defunctionalization and concretization
Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving transformation of an extension of System F with guarded algebraic data types into itself. We also suggest that defunctionalization is an instance of concretization, a more general technique that allows eliminating constructs other t...
متن کاملEducational Robotics in Algorithm Concretization
Algorithm concretization with robots combines hands-on robotics and traditional algorithm visualization techniques to assist diverse learners to understand the basic idea of a given algorithm. In this way, we bring algorithms into the real physical world where students can touch the data structures during the execution. We present a proof-of-concept implementation with a few sorting algorithms....
متن کاملTest Purpose Concretization through Symbolic Action Refinement
In a Model Driven Design process, model refinement methodologies allow one to denote system behaviors at several levels of abstraction. In the frame of a model-based testing process, benefits can be taken from such refinement processes by extracting test cases from the different intermediate models. As a consequence, test cases extracted from abstract models often have to be concretized in orde...
متن کاملAdaptive Concretization for Parallel Program Synthesis
Program synthesis tools work by searching for an implementation that satisfies a given specification. Two popular search strategies are symbolic search, which reduces synthesis to a formula passed to a SAT solver, and explicit search, which uses brute force or random search to find a solution. In this paper, we propose adaptive concretization, a novel synthesis algorithm that combines the best ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Organon F
سال: 2023
ISSN: ['1335-0668', '2585-7150']
DOI: https://doi.org/10.31577/orgf.2023.30205